Self-similarity in bottleneck buffers
نویسندگان
چکیده
We analyze a model of heavily utilized bottleneck buffer in this paper. We show that the nature of traffic leaving the buffer is determined by the buffer length/number of TCPs ratio. If this ratio is above a critical value, TCP can stay in the congestion avoidance phase and it can generate periodic traffic after a transient period. If the ratio is below a critical value then the congestion window dynamics becomes chaotic or stochastic. We demonstrate that the traffic shows self-similar properties in this chaotic phase, which is determined by the exponential backoff mechanism.
منابع مشابه
Effect of TCP on self-similarity of network traffic
It is now well known that Internet traffic exhibits self-similarity, which cannot be described by traditional Markovian models such as the Poisson process. In this work, we simulate a simple network with a full implementation of TCPReno. We also assume Poisson arrivals at the application layer specifically to determine whether TCP can cause self-similarity even when input traffic does not exhib...
متن کاملTCP's role in the propagation of self-similarity in the Internet
This paper analyzes how TCP congestion control can propagate self-similarity between distant areas of the Internet. This property of TCP is due to its congestion control algorithm, which adapts to self-similar fluctuations on several timescales. The mechanisms and limitations of this propagation are investigated. It is demonstrated that if a TCP connection shares a bottleneck link with a self-s...
متن کاملGPU Accelerated Self-join for the Distance Similarity Metric
The self-join finds all objects in a dataset within a threshold of each other defined by a similarity metric. As such, the self-join is a building block for the field of databases and data mining, and is employed in Big Data applications. In this paper, we advance a GPU-efficient algorithm for the similarity self-join that uses the Euclidean distance metric. The search-and-refine strategy is an...
متن کاملAnalysis of Tcp with Several Bottleneck Nodes
Many works have studied the performance of TCP by modeling the network as a single bottleneck node. In this paper, we present a more general model taking into account all the nodes on the path not only the main bottleneck. We show that, in addition to the main bottleneck, the other nodes can seriously affect the performance of TCP. They may cause an improvement in the performance by decreasing ...
متن کاملSelf-similar Network Traac: Implications to Real-time Applications and Qos
Recent measurements of network traac 3, 8] have shown that scale-invariant burstiness|self-similarity| is a ubiquitous phenomenon found in both LANs and WANs as well as many types of traac including compressed video. In 5], a generic high-level (application layer) causal mechanism was advanced for inducing self-similar link traac when incorporating the eeects of the transport layer. The perform...
متن کامل